A Decoder – Look up Tables for FPGAs

نویسندگان

چکیده

The FPGA (Field-Programmable Gate Array) has recently become the popular hardware and so-called LUTs (Look up Tables) are basic of FPGAs logic. For example, n-LUT is MOS pass transistors multiplexer 2n-1 which input data receive SRAM cells logic function configuration (user’s projects Truth Table). Address inputs LUT variables. Therefore, we get one n-arguments for actual configuration. To m functions (even with same n-arguments) should take LUT. Authors propose a novel Decoder (n-DC LUT), makes possible to n-arguments, like in Program Logic Array (PLA) CPLD (Complex Programmable Device). DC activates 2n product terms outputs. Combined OR can n-arguments. do this option use, typical connections units. restriction Meade-Conway allows n=3 tree. Two 3-LUTs 1-LUTs form 4-LUT. Modern Adaptive Modules (ALM) have n=8, but not all implemented. article deals design investigation some variants 3-DC LUT: pull output resistors, orthogonal circuits, each transistor. Simulation confirms feasibility proposed method shows that circuits better variant systems realization current consumption time delay at large n. A further development ALM concept may be introduction adaptive LUT, which, by tuning, calculate single or decoder functions. elements allow increase functionality FPGAs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timing Defect Analysis in Look-Up Tables of SRAM-Based FPGAs

The objective of our article is to demonstrate that some physical defects in a LUT can change its propagation delay. We propose a simplified 'timing' model of the LUT which determines its propagation delay. Such a model is exploited to analyse the effects of a defect on the LUT behaviour, from which we demonstrate that they can cause a timing fault on it. Anywhere in a LUT, a timing defect can ...

متن کامل

A Quick Tables Look-up Optimization Algorithm for CAVLC Decoding

In this paper, a quick table look-up optimization algorithm is presented to solve the problems of long table look-up time for CAVLC decoding in H.264/AVC. The achievement of the new algorithm rests that we make full use of the hash table query and index technology to improve the table look-up speed for CAVLC decoding. The basic idea of the new algorithm is that we take the number of zero in cod...

متن کامل

A High Efficient Tables Look-up Algorithm for CAVLC Decoding

In order to solve the problems of high table memory access and long table look-up time and big table storage space in the process of CAVLC decoding for H.264/AVC, a high efficient table look-up algorithm is presented in this paper. The contribution of this paper lies that we uses a program method to realize fully the no-table looking-up of codeword. Specifically, after finding the relationships...

متن کامل

Rijndael FPGA Implementations Utilising Look-Up Tables

This paper presents single-chip FPGA Rijndael algorithm implementations of the Advanced Encryption Standard (AES) algorithm, Rijndael. In particular, the designs utilise look-up tables to implement the entire Rijndael Round function. A comparison is provided between these designs and similar existing implementations. Hardware implementations of encryption algorithms prove much faster than equiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computing

سال: 2021

ISSN: ['2312-5381', '1727-6209']

DOI: https://doi.org/10.47839/ijc.20.3.2282